/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/hhk2008.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:29:15,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:29:15,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:29:16,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:29:16,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:29:16,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:29:16,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:29:16,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:29:16,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:29:16,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:29:16,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:29:16,018 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:29:16,018 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:29:16,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:29:16,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:29:16,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:29:16,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:29:16,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:29:16,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:29:16,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:29:16,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:29:16,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:29:16,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:29:16,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:29:16,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:29:16,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:29:16,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:29:16,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:29:16,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:29:16,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:29:16,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:29:16,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:29:16,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:29:16,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:29:16,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:29:16,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:29:16,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:29:16,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:29:16,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:29:16,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:29:16,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:29:16,046 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:16,062 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:29:16,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:29:16,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:29:16,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:29:16,064 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:29:16,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:29:16,064 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:29:16,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:29:16,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:29:16,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:29:16,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:29:16,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:29:16,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:29:16,066 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:29:16,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:29:16,066 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:29:16,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:29:16,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:29:16,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:29:16,067 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:29:16,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:29:16,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:16,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:29:16,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:29:16,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:29:16,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:29:16,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:29:16,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:29:16,069 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:29:16,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:29:16,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:29:16,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:29:16,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:29:16,445 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:29:16,446 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:29:16,447 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/hhk2008.i [2020-07-10 15:29:16,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd0738bd/74bcf986285643dba9d543bb1bfe05b3/FLAG2442ddadf [2020-07-10 15:29:17,114 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:29:17,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/hhk2008.i [2020-07-10 15:29:17,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd0738bd/74bcf986285643dba9d543bb1bfe05b3/FLAG2442ddadf [2020-07-10 15:29:17,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dd0738bd/74bcf986285643dba9d543bb1bfe05b3 [2020-07-10 15:29:17,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:29:17,474 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:29:17,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:17,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:29:17,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:29:17,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:17" (1/1) ... [2020-07-10 15:29:17,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716a727c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:17, skipping insertion in model container [2020-07-10 15:29:17,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:17" (1/1) ... [2020-07-10 15:29:17,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:29:17,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:29:17,806 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:17,814 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:29:17,836 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:17,853 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:29:17,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:17 WrapperNode [2020-07-10 15:29:17,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:17,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:29:17,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:29:17,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:29:17,873 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:17" (1/1) ... [2020-07-10 15:29:17,873 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:17" (1/1) ... [2020-07-10 15:29:17,881 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:17" (1/1) ... [2020-07-10 15:29:17,881 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:17" (1/1) ... [2020-07-10 15:29:17,887 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:17" (1/1) ... [2020-07-10 15:29:17,895 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:17" (1/1) ... [2020-07-10 15:29:17,896 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:17" (1/1) ... [2020-07-10 15:29:18,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:29:18,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:29:18,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:29:18,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:29:18,010 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:17" (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:18,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:29:18,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:29:18,090 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:29:18,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:29:18,090 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:29:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:29:18,090 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:29:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:29:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:29:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:29:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:29:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:29:18,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:29:18,422 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:29:18,423 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:29:18,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:18 BoogieIcfgContainer [2020-07-10 15:29:18,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:29:18,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:29:18,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:29:18,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:29:18,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:17" (1/3) ... [2020-07-10 15:29:18,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:18, skipping insertion in model container [2020-07-10 15:29:18,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:17" (2/3) ... [2020-07-10 15:29:18,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b9ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:18, skipping insertion in model container [2020-07-10 15:29:18,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:18" (3/3) ... [2020-07-10 15:29:18,445 INFO L109 eAbstractionObserver]: Analyzing ICFG hhk2008.i [2020-07-10 15:29:18,464 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:29:18,475 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:29:18,499 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:29:18,534 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:29:18,534 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:29:18,534 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:29:18,535 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:29:18,535 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:29:18,536 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:29:18,536 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:29:18,536 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:29:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-10 15:29:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-10 15:29:18,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:18,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:18,575 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash -677001103, now seen corresponding path program 1 times [2020-07-10 15:29:18,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:18,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855839161] [2020-07-10 15:29:18,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:19,125 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:29:19,126 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2020-07-10 15:29:19,130 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-10 15:29:19,131 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-10 15:29:19,132 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #48#return; {23#true} is VALID [2020-07-10 15:29:19,132 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-10 15:29:19,133 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1;havoc ~res~0;havoc ~cnt~0; {23#true} is VALID [2020-07-10 15:29:19,133 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(~a~0 <= 1000000); {23#true} is VALID [2020-07-10 15:29:19,136 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {27#(and (<= main_~res~0 (+ main_~a~0 main_~b~0)) (= main_~cnt~0 main_~b~0) (or (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~a~0 main_~res~0)))} is VALID [2020-07-10 15:29:19,137 INFO L280 TraceCheckUtils]: 7: Hoare triple {27#(and (<= main_~res~0 (+ main_~a~0 main_~b~0)) (= main_~cnt~0 main_~b~0) (or (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~a~0 main_~res~0)))} assume !(~cnt~0 > 0); {28#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 15:29:19,140 INFO L263 TraceCheckUtils]: 8: Hoare triple {28#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {29#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:19,142 INFO L280 TraceCheckUtils]: 9: 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:19,143 INFO L280 TraceCheckUtils]: 10: Hoare triple {30#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {24#false} is VALID [2020-07-10 15:29:19,143 INFO L280 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-10 15:29:19,145 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:19,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855839161] [2020-07-10 15:29:19,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:19,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:29:19,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427308729] [2020-07-10 15:29:19,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-10 15:29:19,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:19,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:29:19,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:19,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:29:19,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:19,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:29:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:29:19,211 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 6 states. [2020-07-10 15:29:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,616 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2020-07-10 15:29:19,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:29:19,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-10 15:29:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:19,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2020-07-10 15:29:19,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2020-07-10 15:29:19,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2020-07-10 15:29:19,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:19,763 INFO L225 Difference]: With dead ends: 41 [2020-07-10 15:29:19,763 INFO L226 Difference]: Without dead ends: 14 [2020-07-10 15:29:19,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:29:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-10 15:29:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-10 15:29:19,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:19,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:19,822 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:19,822 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,825 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:29:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:19,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:19,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:19,826 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:19,827 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:19,831 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-10 15:29:19,831 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:19,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:19,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:19,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:19,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-07-10 15:29:19,836 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-07-10 15:29:19,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:19,836 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-07-10 15:29:19,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:29:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-07-10 15:29:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 15:29:19,837 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:19,838 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:19,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:29:19,838 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:19,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:19,839 INFO L82 PathProgramCache]: Analyzing trace with hash 523340046, now seen corresponding path program 1 times [2020-07-10 15:29:19,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:19,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236947024] [2020-07-10 15:29:19,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:20,085 INFO L280 TraceCheckUtils]: 0: Hoare triple {140#true} assume true; {140#true} is VALID [2020-07-10 15:29:20,086 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {140#true} {140#true} #48#return; {140#true} is VALID [2020-07-10 15:29:20,086 INFO L263 TraceCheckUtils]: 0: Hoare triple {140#true} call ULTIMATE.init(); {140#true} is VALID [2020-07-10 15:29:20,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#true} assume true; {140#true} is VALID [2020-07-10 15:29:20,087 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {140#true} {140#true} #48#return; {140#true} is VALID [2020-07-10 15:29:20,087 INFO L263 TraceCheckUtils]: 3: Hoare triple {140#true} call #t~ret2 := main(); {140#true} is VALID [2020-07-10 15:29:20,088 INFO L280 TraceCheckUtils]: 4: Hoare triple {140#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1;havoc ~res~0;havoc ~cnt~0; {140#true} is VALID [2020-07-10 15:29:20,088 INFO L280 TraceCheckUtils]: 5: Hoare triple {140#true} assume !!(~a~0 <= 1000000); {140#true} is VALID [2020-07-10 15:29:20,089 INFO L280 TraceCheckUtils]: 6: Hoare triple {140#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {144#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} is VALID [2020-07-10 15:29:20,091 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {145#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 15:29:20,093 INFO L280 TraceCheckUtils]: 8: Hoare triple {145#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} assume !(~cnt~0 > 0); {146#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 15:29:20,095 INFO L263 TraceCheckUtils]: 9: Hoare triple {146#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {147#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:20,096 INFO L280 TraceCheckUtils]: 10: Hoare triple {147#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {148#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:20,097 INFO L280 TraceCheckUtils]: 11: Hoare triple {148#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {141#false} is VALID [2020-07-10 15:29:20,098 INFO L280 TraceCheckUtils]: 12: Hoare triple {141#false} assume !false; {141#false} is VALID [2020-07-10 15:29:20,099 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:20,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236947024] [2020-07-10 15:29:20,100 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260297556] [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 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:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:20,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-10 15:29:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:20,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:20,348 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:20,394 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:20,419 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:20,485 INFO L263 TraceCheckUtils]: 0: Hoare triple {140#true} call ULTIMATE.init(); {140#true} is VALID [2020-07-10 15:29:20,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#true} assume true; {140#true} is VALID [2020-07-10 15:29:20,486 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {140#true} {140#true} #48#return; {140#true} is VALID [2020-07-10 15:29:20,487 INFO L263 TraceCheckUtils]: 3: Hoare triple {140#true} call #t~ret2 := main(); {140#true} is VALID [2020-07-10 15:29:20,487 INFO L280 TraceCheckUtils]: 4: Hoare triple {140#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1;havoc ~res~0;havoc ~cnt~0; {140#true} is VALID [2020-07-10 15:29:20,487 INFO L280 TraceCheckUtils]: 5: Hoare triple {140#true} assume !!(~a~0 <= 1000000); {140#true} is VALID [2020-07-10 15:29:20,489 INFO L280 TraceCheckUtils]: 6: Hoare triple {140#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {144#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} is VALID [2020-07-10 15:29:20,491 INFO L280 TraceCheckUtils]: 7: Hoare triple {144#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {173#(and (<= (+ main_~a~0 1) main_~res~0) (<= main_~b~0 (+ main_~cnt~0 1)) (<= main_~res~0 (+ main_~a~0 1)) (< 0 main_~b~0))} is VALID [2020-07-10 15:29:20,493 INFO L280 TraceCheckUtils]: 8: Hoare triple {173#(and (<= (+ main_~a~0 1) main_~res~0) (<= main_~b~0 (+ main_~cnt~0 1)) (<= main_~res~0 (+ main_~a~0 1)) (< 0 main_~b~0))} assume !(~cnt~0 > 0); {177#(and (<= (+ main_~a~0 1) main_~res~0) (<= main_~b~0 1) (<= main_~res~0 (+ main_~a~0 1)) (< 0 main_~b~0))} is VALID [2020-07-10 15:29:20,495 INFO L263 TraceCheckUtils]: 9: Hoare triple {177#(and (<= (+ main_~a~0 1) main_~res~0) (<= main_~b~0 1) (<= main_~res~0 (+ main_~a~0 1)) (< 0 main_~b~0))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {181#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:20,497 INFO L280 TraceCheckUtils]: 10: Hoare triple {181#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {185#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:20,498 INFO L280 TraceCheckUtils]: 11: Hoare triple {185#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {141#false} is VALID [2020-07-10 15:29:20,498 INFO L280 TraceCheckUtils]: 12: Hoare triple {141#false} assume !false; {141#false} is VALID [2020-07-10 15:29:20,500 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:20,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:20,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-07-10 15:29:20,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842490837] [2020-07-10 15:29:20,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2020-07-10 15:29:20,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:20,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:29:20,534 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:20,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:29:20,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:20,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:29:20,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:29:20,535 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 11 states. [2020-07-10 15:29:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:20,791 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-07-10 15:29:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:29:20,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2020-07-10 15:29:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:29:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-10 15:29:20,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:29:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-10 15:29:20,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2020-07-10 15:29:20,833 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:20,834 INFO L225 Difference]: With dead ends: 20 [2020-07-10 15:29:20,834 INFO L226 Difference]: Without dead ends: 15 [2020-07-10 15:29:20,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:29:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-10 15:29:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-10 15:29:20,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:20,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:20,853 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:20,853 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:20,855 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:29:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:20,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:20,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:20,857 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:20,857 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-10 15:29:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:20,859 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-07-10 15:29:20,859 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:20,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:20,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:20,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:20,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:20,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:29:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-07-10 15:29:20,863 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2020-07-10 15:29:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:20,864 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-07-10 15:29:20,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:29:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-07-10 15:29:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:29:20,865 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:20,866 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:21,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:29:21,081 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:21,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:21,082 INFO L82 PathProgramCache]: Analyzing trace with hash -920789999, now seen corresponding path program 2 times [2020-07-10 15:29:21,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:21,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665753255] [2020-07-10 15:29:21,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:21,308 INFO L280 TraceCheckUtils]: 0: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 15:29:21,309 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {282#true} {282#true} #48#return; {282#true} is VALID [2020-07-10 15:29:21,309 INFO L263 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {282#true} is VALID [2020-07-10 15:29:21,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 15:29:21,310 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {282#true} #48#return; {282#true} is VALID [2020-07-10 15:29:21,310 INFO L263 TraceCheckUtils]: 3: Hoare triple {282#true} call #t~ret2 := main(); {282#true} is VALID [2020-07-10 15:29:21,310 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1;havoc ~res~0;havoc ~cnt~0; {282#true} is VALID [2020-07-10 15:29:21,311 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} assume !!(~a~0 <= 1000000); {282#true} is VALID [2020-07-10 15:29:21,312 INFO L280 TraceCheckUtils]: 6: Hoare triple {282#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {286#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} is VALID [2020-07-10 15:29:21,313 INFO L280 TraceCheckUtils]: 7: Hoare triple {286#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {287#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 15:29:21,315 INFO L280 TraceCheckUtils]: 8: Hoare triple {287#(and (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~res~0 main_~cnt~0) (+ main_~a~0 main_~b~0)))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {288#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 15:29:21,317 INFO L280 TraceCheckUtils]: 9: Hoare triple {288#(and (or (<= (+ main_~a~0 main_~b~0) (+ main_~res~0 main_~cnt~0)) (<= (+ main_~a~0 main_~b~0) main_~res~0)) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} assume !(~cnt~0 > 0); {289#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} is VALID [2020-07-10 15:29:21,318 INFO L263 TraceCheckUtils]: 10: Hoare triple {289#(and (<= (+ main_~a~0 main_~b~0) main_~res~0) (<= main_~res~0 (+ main_~a~0 main_~b~0)))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {290#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:21,319 INFO L280 TraceCheckUtils]: 11: Hoare triple {290#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {291#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:21,320 INFO L280 TraceCheckUtils]: 12: Hoare triple {291#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {283#false} is VALID [2020-07-10 15:29:21,321 INFO L280 TraceCheckUtils]: 13: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-10 15:29:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:21,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665753255] [2020-07-10 15:29:21,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741333746] [2020-07-10 15:29:21,323 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:21,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:29:21,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:21,359 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-10 15:29:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:21,367 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:21,562 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:21,593 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:21,624 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:21,683 INFO L263 TraceCheckUtils]: 0: Hoare triple {282#true} call ULTIMATE.init(); {282#true} is VALID [2020-07-10 15:29:21,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {282#true} assume true; {282#true} is VALID [2020-07-10 15:29:21,683 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {282#true} {282#true} #48#return; {282#true} is VALID [2020-07-10 15:29:21,684 INFO L263 TraceCheckUtils]: 3: Hoare triple {282#true} call #t~ret2 := main(); {282#true} is VALID [2020-07-10 15:29:21,684 INFO L280 TraceCheckUtils]: 4: Hoare triple {282#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~b~0 := #t~nondet1;havoc #t~nondet1;havoc ~res~0;havoc ~cnt~0; {282#true} is VALID [2020-07-10 15:29:21,684 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#true} assume !!(~a~0 <= 1000000); {282#true} is VALID [2020-07-10 15:29:21,686 INFO L280 TraceCheckUtils]: 6: Hoare triple {282#true} assume !!(0 <= ~b~0 && ~b~0 <= 1000000);~res~0 := ~a~0;~cnt~0 := ~b~0; {286#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} is VALID [2020-07-10 15:29:21,687 INFO L280 TraceCheckUtils]: 7: Hoare triple {286#(and (<= main_~res~0 main_~a~0) (<= main_~a~0 main_~res~0) (= main_~cnt~0 main_~b~0))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {316#(and (<= (+ main_~a~0 1) main_~res~0) (= (+ main_~cnt~0 1) main_~b~0) (<= main_~res~0 (+ main_~a~0 1)))} is VALID [2020-07-10 15:29:21,695 INFO L280 TraceCheckUtils]: 8: Hoare triple {316#(and (<= (+ main_~a~0 1) main_~res~0) (= (+ main_~cnt~0 1) main_~b~0) (<= main_~res~0 (+ main_~a~0 1)))} assume !!(~cnt~0 > 0);~cnt~0 := ~cnt~0 - 1;~res~0 := 1 + ~res~0; {320#(and (<= main_~b~0 (+ main_~cnt~0 2)) (< 1 main_~b~0) (<= (+ main_~a~0 2) main_~res~0) (<= main_~res~0 (+ main_~a~0 2)))} is VALID [2020-07-10 15:29:21,696 INFO L280 TraceCheckUtils]: 9: Hoare triple {320#(and (<= main_~b~0 (+ main_~cnt~0 2)) (< 1 main_~b~0) (<= (+ main_~a~0 2) main_~res~0) (<= main_~res~0 (+ main_~a~0 2)))} assume !(~cnt~0 > 0); {324#(and (< 1 main_~b~0) (<= (+ main_~a~0 2) main_~res~0) (<= main_~res~0 (+ main_~a~0 2)) (<= main_~b~0 2))} is VALID [2020-07-10 15:29:21,699 INFO L263 TraceCheckUtils]: 10: Hoare triple {324#(and (< 1 main_~b~0) (<= (+ main_~a~0 2) main_~res~0) (<= main_~res~0 (+ main_~a~0 2)) (<= main_~b~0 2))} call __VERIFIER_assert((if ~res~0 == ~a~0 + ~b~0 then 1 else 0)); {328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:21,700 INFO L280 TraceCheckUtils]: 11: Hoare triple {328#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:21,700 INFO L280 TraceCheckUtils]: 12: Hoare triple {332#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {283#false} is VALID [2020-07-10 15:29:21,701 INFO L280 TraceCheckUtils]: 13: Hoare triple {283#false} assume !false; {283#false} is VALID [2020-07-10 15:29:21,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:21,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:21,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2020-07-10 15:29:21,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050634005] [2020-07-10 15:29:21,703 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2020-07-10 15:29:21,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:21,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:29:21,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:21,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:29:21,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:21,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:29:21,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:29:21,733 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 13 states. [2020-07-10 15:29:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:22,204 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2020-07-10 15:29:22,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:29:22,204 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2020-07-10 15:29:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:22,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:22,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-07-10 15:29:22,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:29:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-07-10 15:29:22,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2020-07-10 15:29:22,259 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:22,259 INFO L225 Difference]: With dead ends: 17 [2020-07-10 15:29:22,259 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:22,261 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2020-07-10 15:29:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:22,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:22,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:22,262 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:22,262 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:22,263 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:22,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:22,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:22,264 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:22,264 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:22,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:22,265 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:22,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:22,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:22,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:22,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:22,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:22,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-10 15:29:22,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:22,267 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:22,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:29:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:22,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:22,468 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:22,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:22,656 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:29:22,656 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:22,656 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:22,656 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:22,657 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:22,657 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:22,657 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:22,657 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:29:22,657 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:22,657 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:22,657 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 27) the Hoare annotation is: true [2020-07-10 15:29:22,658 INFO L268 CegarLoopResult]: For program point L25(line 25) no Hoare annotation was computed. [2020-07-10 15:29:22,658 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 27) no Hoare annotation was computed. [2020-07-10 15:29:22,658 INFO L264 CegarLoopResult]: At program point L21-2(lines 21 24) the Hoare annotation is: (let ((.cse1 (+ main_~res~0 main_~cnt~0)) (.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 .cse1) (<= main_~res~0 .cse0) (<= .cse1 .cse0))) [2020-07-10 15:29:22,659 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-10 15:29:22,660 INFO L264 CegarLoopResult]: At program point L21-3(lines 21 24) the Hoare annotation is: (let ((.cse1 (+ main_~a~0 main_~b~0))) (let ((.cse3 (<= .cse1 main_~res~0)) (.cse4 (<= main_~res~0 .cse1))) (or (let ((.cse0 (+ main_~a~0 1))) (and (<= .cse0 main_~res~0) (<= main_~b~0 1) (<= main_~b~0 (+ main_~cnt~0 1)) (<= main_~res~0 .cse0) (< 0 main_~b~0))) (let ((.cse2 (+ main_~res~0 main_~cnt~0))) (and (<= .cse1 .cse2) .cse3 .cse4 (<= .cse2 .cse1))) (and .cse3 .cse4 (= main_~cnt~0 main_~b~0))))) [2020-07-10 15:29:22,660 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-10 15:29:22,660 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 27) no Hoare annotation was computed. [2020-07-10 15:29:22,660 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:29:22,660 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:22,660 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:29:22,661 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:29:22,661 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:22,661 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:29:22,667 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:22,667 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:22,668 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:22,668 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:22,668 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:22,668 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:22,668 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:22,668 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:22,668 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:22,668 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:22,669 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:22,669 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:22,669 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:22,669 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:29:22,669 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:22,669 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:29:22,669 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2020-07-10 15:29:22,670 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:22,670 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:22,670 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:29:22,670 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:22,675 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:22,675 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:29:22,675 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-10 15:29:22,676 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:22,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:22 BoogieIcfgContainer [2020-07-10 15:29:22,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:22,706 INFO L168 Benchmark]: Toolchain (without parser) took 5229.09 ms. Allocated memory was 135.8 MB in the beginning and 255.3 MB in the end (delta: 119.5 MB). Free memory was 101.1 MB in the beginning and 200.9 MB in the end (delta: -99.8 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:22,707 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:29:22,708 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.07 ms. Allocated memory is still 135.8 MB. Free memory was 100.7 MB in the beginning and 91.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:22,709 INFO L168 Benchmark]: Boogie Preprocessor took 151.67 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 91.0 MB in the beginning and 180.0 MB in the end (delta: -89.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:22,710 INFO L168 Benchmark]: RCFGBuilder took 422.14 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 163.0 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:22,711 INFO L168 Benchmark]: TraceAbstraction took 4269.45 ms. Allocated memory was 200.8 MB in the beginning and 255.3 MB in the end (delta: 54.5 MB). Free memory was 162.3 MB in the beginning and 200.9 MB in the end (delta: -38.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:22,716 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.27 ms. Allocated memory is still 135.8 MB. Free memory was 118.9 MB in the beginning and 118.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 379.07 ms. Allocated memory is still 135.8 MB. Free memory was 100.7 MB in the beginning and 91.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 151.67 ms. Allocated memory was 135.8 MB in the beginning and 200.8 MB in the end (delta: 65.0 MB). Free memory was 91.0 MB in the beginning and 180.0 MB in the end (delta: -89.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 422.14 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 163.0 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4269.45 ms. Allocated memory was 200.8 MB in the beginning and 255.3 MB in the end (delta: 54.5 MB). Free memory was 162.3 MB in the beginning and 200.9 MB in the end (delta: -38.6 MB). Peak memory consumption was 15.9 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: 21]: Loop Invariant Derived loop invariant: (a + b <= res + cnt && res <= a + b) && res + cnt <= a + b - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.9s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 38 SDtfs, 22 SDslu, 134 SDs, 0 SdLazy, 103 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 18 NumberOfFragments, 87 HoareAnnotationTreeSize, 11 FomulaSimplifications, 9 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 90 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 3737 SizeOfPredicates, 6 NumberOfNonLiveVariables, 85 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/8 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...