java -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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/bitvector/byte_add-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:36:05,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:36:05,481 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:36:05,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:36:05,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:36:05,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:36:05,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:36:05,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:36:05,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:36:05,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:36:05,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:36:05,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:36:05,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:36:05,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:36:05,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:36:05,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:36:05,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:36:05,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:36:05,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:36:05,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:36:05,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:36:05,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:36:05,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:36:05,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:36:05,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:36:05,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:36:05,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:36:05,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:36:05,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:36:05,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:36:05,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:36:05,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:36:05,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:36:05,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:36:05,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:36:05,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:36:05,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:36:05,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:36:05,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:36:05,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:36:05,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:36:05,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:36:05,553 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:36:05,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:36:05,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:36:05,554 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:36:05,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:36:05,555 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:36:05,555 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:36:05,556 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:36:05,556 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:36:05,556 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:36:05,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:36:05,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:36:05,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:36:05,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:36:05,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:36:05,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:36:05,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:36:05,559 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:36:05,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:36:05,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:36:05,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:36:05,560 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:36:05,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:36:05,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:36:05,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:36:05,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:36:05,561 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:36:05,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:36:05,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:36:05,562 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:36:05,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:36:05,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:36:05,614 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:36:05,616 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:36:05,616 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:36:05,617 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/byte_add-1.i [2019-09-09 05:36:05,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d90fa04/515f886c39674aca8d857c89a2033090/FLAG9ffe004d0 [2019-09-09 05:36:06,134 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:36:06,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/byte_add-1.i [2019-09-09 05:36:06,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d90fa04/515f886c39674aca8d857c89a2033090/FLAG9ffe004d0 [2019-09-09 05:36:06,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d90fa04/515f886c39674aca8d857c89a2033090 [2019-09-09 05:36:06,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:36:06,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:36:06,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:36:06,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:36:06,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:36:06,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:36:06" (1/1) ... [2019-09-09 05:36:06,542 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a71346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:06, skipping insertion in model container [2019-09-09 05:36:06,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:36:06" (1/1) ... [2019-09-09 05:36:06,550 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:36:06,593 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:36:06,841 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:36:06,846 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:36:07,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:36:07,048 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:36:07,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:07 WrapperNode [2019-09-09 05:36:07,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:36:07,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:36:07,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:36:07,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:36:07,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:07" (1/1) ... [2019-09-09 05:36:07,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:07" (1/1) ... [2019-09-09 05:36:07,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:07" (1/1) ... [2019-09-09 05:36:07,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:07" (1/1) ... [2019-09-09 05:36:07,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:07" (1/1) ... [2019-09-09 05:36:07,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:07" (1/1) ... [2019-09-09 05:36:07,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:07" (1/1) ... [2019-09-09 05:36:07,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:36:07,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:36:07,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:36:07,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:36:07,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:07" (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 [2019-09-09 05:36:07,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:36:07,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:36:07,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-09 05:36:07,239 INFO L138 BoogieDeclarations]: Found implementation of procedure mp_add [2019-09-09 05:36:07,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:36:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:36:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-09 05:36:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-09 05:36:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-09 05:36:07,240 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2019-09-09 05:36:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2019-09-09 05:36:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure mp_add [2019-09-09 05:36:07,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:36:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:36:07,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:36:07,680 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:36:07,680 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-09 05:36:07,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:36:07 BoogieIcfgContainer [2019-09-09 05:36:07,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:36:07,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:36:07,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:36:07,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:36:07,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:36:06" (1/3) ... [2019-09-09 05:36:07,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341154ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:36:07, skipping insertion in model container [2019-09-09 05:36:07,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:36:07" (2/3) ... [2019-09-09 05:36:07,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341154ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:36:07, skipping insertion in model container [2019-09-09 05:36:07,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:36:07" (3/3) ... [2019-09-09 05:36:07,690 INFO L109 eAbstractionObserver]: Analyzing ICFG byte_add-1.i [2019-09-09 05:36:07,700 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:36:07,708 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:36:07,724 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:36:07,752 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:36:07,752 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:36:07,752 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:36:07,753 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:36:07,753 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:36:07,753 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:36:07,753 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:36:07,753 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:36:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-09-09 05:36:07,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:36:07,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:07,783 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:07,785 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:07,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:07,790 INFO L82 PathProgramCache]: Analyzing trace with hash 397916932, now seen corresponding path program 1 times [2019-09-09 05:36:07,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:07,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:07,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:07,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:07,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:07,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:07,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:07,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-09 05:36:07,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:07,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-09 05:36:07,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-09 05:36:07,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:36:07,947 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2019-09-09 05:36:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:07,968 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2019-09-09 05:36:07,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-09 05:36:07,970 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2019-09-09 05:36:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:07,982 INFO L225 Difference]: With dead ends: 54 [2019-09-09 05:36:07,982 INFO L226 Difference]: Without dead ends: 47 [2019-09-09 05:36:07,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-09 05:36:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-09 05:36:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-09-09 05:36:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-09 05:36:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2019-09-09 05:36:08,027 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 73 transitions. Word has length 21 [2019-09-09 05:36:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:08,027 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 73 transitions. [2019-09-09 05:36:08,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-09 05:36:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 73 transitions. [2019-09-09 05:36:08,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-09 05:36:08,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:08,029 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:08,030 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:08,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:08,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1531564698, now seen corresponding path program 1 times [2019-09-09 05:36:08,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:08,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:08,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:08,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:08,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:08,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:08,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:08,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-09 05:36:08,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:08,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-09 05:36:08,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-09 05:36:08,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:36:08,171 INFO L87 Difference]: Start difference. First operand 47 states and 73 transitions. Second operand 3 states. [2019-09-09 05:36:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:08,439 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2019-09-09 05:36:08,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-09 05:36:08,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-09-09 05:36:08,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:08,441 INFO L225 Difference]: With dead ends: 70 [2019-09-09 05:36:08,442 INFO L226 Difference]: Without dead ends: 70 [2019-09-09 05:36:08,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-09 05:36:08,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-09 05:36:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-09-09 05:36:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-09 05:36:08,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2019-09-09 05:36:08,453 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 21 [2019-09-09 05:36:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:08,453 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2019-09-09 05:36:08,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-09 05:36:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2019-09-09 05:36:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-09 05:36:08,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:08,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:08,455 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:08,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1473767205, now seen corresponding path program 1 times [2019-09-09 05:36:08,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:08,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:08,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:08,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:36:08,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:08,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:36:08,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:08,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:36:08,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:36:08,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:36:08,580 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 4 states. [2019-09-09 05:36:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:08,928 INFO L93 Difference]: Finished difference Result 127 states and 173 transitions. [2019-09-09 05:36:08,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:08,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-09-09 05:36:08,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:08,931 INFO L225 Difference]: With dead ends: 127 [2019-09-09 05:36:08,932 INFO L226 Difference]: Without dead ends: 127 [2019-09-09 05:36:08,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-09 05:36:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2019-09-09 05:36:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-09-09 05:36:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2019-09-09 05:36:08,943 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 27 [2019-09-09 05:36:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:08,944 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2019-09-09 05:36:08,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:36:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2019-09-09 05:36:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-09 05:36:08,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:08,945 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:08,946 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:08,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:08,948 INFO L82 PathProgramCache]: Analyzing trace with hash -13869364, now seen corresponding path program 1 times [2019-09-09 05:36:08,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:08,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:08,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:08,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:08,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-09 05:36:09,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:09,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:36:09,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:09,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:36:09,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:36:09,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:36:09,025 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand 4 states. [2019-09-09 05:36:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:09,201 INFO L93 Difference]: Finished difference Result 162 states and 234 transitions. [2019-09-09 05:36:09,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:09,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-09-09 05:36:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:09,205 INFO L225 Difference]: With dead ends: 162 [2019-09-09 05:36:09,206 INFO L226 Difference]: Without dead ends: 158 [2019-09-09 05:36:09,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-09-09 05:36:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 148. [2019-09-09 05:36:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-09 05:36:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 219 transitions. [2019-09-09 05:36:09,220 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 219 transitions. Word has length 33 [2019-09-09 05:36:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:09,221 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 219 transitions. [2019-09-09 05:36:09,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:36:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 219 transitions. [2019-09-09 05:36:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-09 05:36:09,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:09,223 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:09,223 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:09,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:09,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2027075515, now seen corresponding path program 1 times [2019-09-09 05:36:09,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:09,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:09,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:09,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-09 05:36:09,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:09,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:36:09,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:09,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:36:09,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:36:09,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:36:09,324 INFO L87 Difference]: Start difference. First operand 148 states and 219 transitions. Second operand 4 states. [2019-09-09 05:36:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:09,595 INFO L93 Difference]: Finished difference Result 312 states and 451 transitions. [2019-09-09 05:36:09,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:09,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-09-09 05:36:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:09,599 INFO L225 Difference]: With dead ends: 312 [2019-09-09 05:36:09,600 INFO L226 Difference]: Without dead ends: 311 [2019-09-09 05:36:09,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-09 05:36:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 212. [2019-09-09 05:36:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-09 05:36:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 324 transitions. [2019-09-09 05:36:09,640 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 324 transitions. Word has length 34 [2019-09-09 05:36:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:09,640 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 324 transitions. [2019-09-09 05:36:09,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:36:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 324 transitions. [2019-09-09 05:36:09,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-09 05:36:09,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:09,645 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:09,646 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:09,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1068918534, now seen corresponding path program 1 times [2019-09-09 05:36:09,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:09,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:09,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:09,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:09,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-09 05:36:09,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:09,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-09 05:36:09,785 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:09,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:36:09,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:36:09,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-09 05:36:09,786 INFO L87 Difference]: Start difference. First operand 212 states and 324 transitions. Second operand 4 states. [2019-09-09 05:36:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:10,057 INFO L93 Difference]: Finished difference Result 433 states and 654 transitions. [2019-09-09 05:36:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:10,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-09-09 05:36:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:10,062 INFO L225 Difference]: With dead ends: 433 [2019-09-09 05:36:10,062 INFO L226 Difference]: Without dead ends: 432 [2019-09-09 05:36:10,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-09 05:36:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 277. [2019-09-09 05:36:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-09-09 05:36:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 441 transitions. [2019-09-09 05:36:10,086 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 441 transitions. Word has length 40 [2019-09-09 05:36:10,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:10,087 INFO L475 AbstractCegarLoop]: Abstraction has 277 states and 441 transitions. [2019-09-09 05:36:10,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:36:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 441 transitions. [2019-09-09 05:36:10,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-09 05:36:10,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:10,090 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:10,090 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:10,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash -213142741, now seen corresponding path program 1 times [2019-09-09 05:36:10,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:10,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:10,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:10,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-09 05:36:10,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:10,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:36:10,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:10,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:36:10,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:36:10,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:10,192 INFO L87 Difference]: Start difference. First operand 277 states and 441 transitions. Second operand 5 states. [2019-09-09 05:36:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:10,499 INFO L93 Difference]: Finished difference Result 564 states and 890 transitions. [2019-09-09 05:36:10,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:36:10,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-09-09 05:36:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:10,504 INFO L225 Difference]: With dead ends: 564 [2019-09-09 05:36:10,504 INFO L226 Difference]: Without dead ends: 564 [2019-09-09 05:36:10,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:36:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-09-09 05:36:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 287. [2019-09-09 05:36:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-09 05:36:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 454 transitions. [2019-09-09 05:36:10,521 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 454 transitions. Word has length 46 [2019-09-09 05:36:10,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:10,522 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 454 transitions. [2019-09-09 05:36:10,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:36:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 454 transitions. [2019-09-09 05:36:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-09 05:36:10,532 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:10,532 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:10,533 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:10,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1878612609, now seen corresponding path program 1 times [2019-09-09 05:36:10,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:10,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:10,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:10,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:10,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-09 05:36:10,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:10,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:36:10,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:10,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:36:10,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:36:10,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:36:10,655 INFO L87 Difference]: Start difference. First operand 287 states and 454 transitions. Second operand 6 states. [2019-09-09 05:36:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:11,248 INFO L93 Difference]: Finished difference Result 887 states and 1398 transitions. [2019-09-09 05:36:11,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:36:11,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-09-09 05:36:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:11,253 INFO L225 Difference]: With dead ends: 887 [2019-09-09 05:36:11,253 INFO L226 Difference]: Without dead ends: 887 [2019-09-09 05:36:11,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:36:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-09-09 05:36:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 287. [2019-09-09 05:36:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-09-09 05:36:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 454 transitions. [2019-09-09 05:36:11,266 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 454 transitions. Word has length 47 [2019-09-09 05:36:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:11,266 INFO L475 AbstractCegarLoop]: Abstraction has 287 states and 454 transitions. [2019-09-09 05:36:11,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:36:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 454 transitions. [2019-09-09 05:36:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-09 05:36:11,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:11,268 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:11,268 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:11,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:11,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1498452256, now seen corresponding path program 1 times [2019-09-09 05:36:11,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:11,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:11,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:11,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:11,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-09 05:36:11,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:11,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-09 05:36:11,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:11,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:36:11,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:36:11,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:36:11,374 INFO L87 Difference]: Start difference. First operand 287 states and 454 transitions. Second operand 6 states. [2019-09-09 05:36:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:11,913 INFO L93 Difference]: Finished difference Result 469 states and 731 transitions. [2019-09-09 05:36:11,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:36:11,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-09-09 05:36:11,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:11,918 INFO L225 Difference]: With dead ends: 469 [2019-09-09 05:36:11,918 INFO L226 Difference]: Without dead ends: 469 [2019-09-09 05:36:11,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:36:11,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-09-09 05:36:11,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 401. [2019-09-09 05:36:11,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-09-09 05:36:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 640 transitions. [2019-09-09 05:36:11,930 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 640 transitions. Word has length 48 [2019-09-09 05:36:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:11,931 INFO L475 AbstractCegarLoop]: Abstraction has 401 states and 640 transitions. [2019-09-09 05:36:11,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:36:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 640 transitions. [2019-09-09 05:36:11,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-09 05:36:11,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:11,932 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:11,933 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:11,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:11,933 INFO L82 PathProgramCache]: Analyzing trace with hash -211268504, now seen corresponding path program 1 times [2019-09-09 05:36:11,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:11,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:11,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:11,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:11,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:12,043 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-09 05:36:12,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:12,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-09 05:36:12,044 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:12,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:36:12,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:36:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-09 05:36:12,045 INFO L87 Difference]: Start difference. First operand 401 states and 640 transitions. Second operand 8 states. [2019-09-09 05:36:13,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:13,198 INFO L93 Difference]: Finished difference Result 1882 states and 2979 transitions. [2019-09-09 05:36:13,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 05:36:13,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-09-09 05:36:13,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:13,210 INFO L225 Difference]: With dead ends: 1882 [2019-09-09 05:36:13,210 INFO L226 Difference]: Without dead ends: 1882 [2019-09-09 05:36:13,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:36:13,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2019-09-09 05:36:13,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1379. [2019-09-09 05:36:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1379 states. [2019-09-09 05:36:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2225 transitions. [2019-09-09 05:36:13,254 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2225 transitions. Word has length 49 [2019-09-09 05:36:13,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:13,255 INFO L475 AbstractCegarLoop]: Abstraction has 1379 states and 2225 transitions. [2019-09-09 05:36:13,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:36:13,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2225 transitions. [2019-09-09 05:36:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-09 05:36:13,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:13,258 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:13,258 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:13,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:13,258 INFO L82 PathProgramCache]: Analyzing trace with hash 968985203, now seen corresponding path program 1 times [2019-09-09 05:36:13,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:13,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:13,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:13,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:13,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-09 05:36:13,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:13,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-09 05:36:13,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:13,396 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-09 05:36:13,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-09 05:36:13,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:36:13,397 INFO L87 Difference]: Start difference. First operand 1379 states and 2225 transitions. Second operand 5 states. [2019-09-09 05:36:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:13,718 INFO L93 Difference]: Finished difference Result 1552 states and 2424 transitions. [2019-09-09 05:36:13,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-09 05:36:13,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-09-09 05:36:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:13,729 INFO L225 Difference]: With dead ends: 1552 [2019-09-09 05:36:13,729 INFO L226 Difference]: Without dead ends: 1531 [2019-09-09 05:36:13,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:36:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2019-09-09 05:36:13,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1454. [2019-09-09 05:36:13,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-09-09 05:36:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2310 transitions. [2019-09-09 05:36:13,782 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2310 transitions. Word has length 54 [2019-09-09 05:36:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:13,783 INFO L475 AbstractCegarLoop]: Abstraction has 1454 states and 2310 transitions. [2019-09-09 05:36:13,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-09 05:36:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2310 transitions. [2019-09-09 05:36:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-09 05:36:13,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:13,786 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:13,787 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:13,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:13,787 INFO L82 PathProgramCache]: Analyzing trace with hash 752188361, now seen corresponding path program 1 times [2019-09-09 05:36:13,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:13,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:13,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:13,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:13,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-09 05:36:13,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:36:13,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:36:13,912 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2019-09-09 05:36:13,916 INFO L207 CegarAbsIntRunner]: [0], [3], [14], [19], [22], [25], [28], [38], [45], [47], [50], [53], [61], [67], [73], [106], [112], [116], [124], [130], [136], [138], [147], [149], [154], [158], [160], [164], [166], [170], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2019-09-09 05:36:13,989 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:36:13,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:36:14,132 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:36:15,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:36:15,445 INFO L272 AbstractInterpreter]: Visited 46 different actions 3710 times. Merged at 14 different actions 2560 times. Never widened. Performed 8977 root evaluator evaluations with a maximum evaluation depth of 8. Performed 8977 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1103 fixpoints after 9 different actions. Largest state had 23 variables. [2019-09-09 05:36:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:15,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:36:15,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:36:15,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:36:15,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:15,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:36:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:15,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-09 05:36:15,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:36:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-09 05:36:15,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:36:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:36:15,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:36:15,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 15 [2019-09-09 05:36:15,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:15,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:36:15,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:36:15,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-09-09 05:36:15,895 INFO L87 Difference]: Start difference. First operand 1454 states and 2310 transitions. Second operand 6 states. [2019-09-09 05:36:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:16,387 INFO L93 Difference]: Finished difference Result 1762 states and 2628 transitions. [2019-09-09 05:36:16,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-09 05:36:16,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-09-09 05:36:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:16,396 INFO L225 Difference]: With dead ends: 1762 [2019-09-09 05:36:16,396 INFO L226 Difference]: Without dead ends: 1744 [2019-09-09 05:36:16,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-09-09 05:36:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2019-09-09 05:36:16,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1569. [2019-09-09 05:36:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1569 states. [2019-09-09 05:36:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2393 transitions. [2019-09-09 05:36:16,445 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2393 transitions. Word has length 55 [2019-09-09 05:36:16,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:16,447 INFO L475 AbstractCegarLoop]: Abstraction has 1569 states and 2393 transitions. [2019-09-09 05:36:16,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:36:16,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2393 transitions. [2019-09-09 05:36:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-09 05:36:16,449 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:16,449 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:16,450 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:16,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1415790296, now seen corresponding path program 1 times [2019-09-09 05:36:16,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:16,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:16,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:16,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:16,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-09 05:36:16,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:36:16,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-09 05:36:16,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:16,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-09 05:36:16,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-09 05:36:16,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-09 05:36:16,630 INFO L87 Difference]: Start difference. First operand 1569 states and 2393 transitions. Second operand 9 states. [2019-09-09 05:36:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:17,838 INFO L93 Difference]: Finished difference Result 2386 states and 3489 transitions. [2019-09-09 05:36:17,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-09 05:36:17,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-09-09 05:36:17,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:17,850 INFO L225 Difference]: With dead ends: 2386 [2019-09-09 05:36:17,850 INFO L226 Difference]: Without dead ends: 2378 [2019-09-09 05:36:17,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:36:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2019-09-09 05:36:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 1903. [2019-09-09 05:36:17,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-09-09 05:36:17,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 2874 transitions. [2019-09-09 05:36:17,898 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 2874 transitions. Word has length 56 [2019-09-09 05:36:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:17,898 INFO L475 AbstractCegarLoop]: Abstraction has 1903 states and 2874 transitions. [2019-09-09 05:36:17,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-09 05:36:17,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 2874 transitions. [2019-09-09 05:36:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-09 05:36:17,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:17,902 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:17,902 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:17,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:17,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1793263524, now seen corresponding path program 1 times [2019-09-09 05:36:17,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:17,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:17,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:17,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:17,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-09 05:36:18,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:36:18,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-09 05:36:18,010 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2019-09-09 05:36:18,010 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [19], [22], [33], [38], [45], [47], [50], [53], [61], [67], [73], [80], [83], [91], [97], [103], [112], [116], [124], [130], [136], [138], [147], [149], [154], [158], [160], [164], [166], [170], [172], [174], [178], [179], [180], [184], [186], [190], [193], [195], [201], [202], [203], [205], [206], [207] [2019-09-09 05:36:18,015 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:36:18,015 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:36:18,018 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:36:19,259 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:36:19,260 INFO L272 AbstractInterpreter]: Visited 50 different actions 6853 times. Merged at 14 different actions 4751 times. Never widened. Performed 15290 root evaluator evaluations with a maximum evaluation depth of 8. Performed 15290 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 2051 fixpoints after 9 different actions. Largest state had 23 variables. [2019-09-09 05:36:19,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:19,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:36:19,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:36:19,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:36:19,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:19,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:36:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:36:19,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-09 05:36:19,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:36:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-09 05:36:19,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:36:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-09 05:36:19,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-09 05:36:19,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 15 [2019-09-09 05:36:19,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:36:19,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:36:19,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:36:19,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-09 05:36:19,643 INFO L87 Difference]: Start difference. First operand 1903 states and 2874 transitions. Second operand 6 states. [2019-09-09 05:36:20,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:36:20,182 INFO L93 Difference]: Finished difference Result 2157 states and 3148 transitions. [2019-09-09 05:36:20,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-09 05:36:20,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-09-09 05:36:20,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:36:20,194 INFO L225 Difference]: With dead ends: 2157 [2019-09-09 05:36:20,194 INFO L226 Difference]: Without dead ends: 2151 [2019-09-09 05:36:20,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-09-09 05:36:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2019-09-09 05:36:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 1894. [2019-09-09 05:36:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1894 states. [2019-09-09 05:36:20,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2847 transitions. [2019-09-09 05:36:20,241 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2847 transitions. Word has length 59 [2019-09-09 05:36:20,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:36:20,241 INFO L475 AbstractCegarLoop]: Abstraction has 1894 states and 2847 transitions. [2019-09-09 05:36:20,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:36:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2847 transitions. [2019-09-09 05:36:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-09 05:36:20,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:36:20,244 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:36:20,245 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:36:20,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:36:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash -313662180, now seen corresponding path program 1 times [2019-09-09 05:36:20,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:36:20,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:20,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:36:20,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:36:20,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:36:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:36:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-09 05:36:20,300 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-09 05:36:20,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:36:20 BoogieIcfgContainer [2019-09-09 05:36:20,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:36:20,401 INFO L168 Benchmark]: Toolchain (without parser) took 13867.38 ms. Allocated memory was 134.7 MB in the beginning and 348.1 MB in the end (delta: 213.4 MB). Free memory was 89.1 MB in the beginning and 272.2 MB in the end (delta: -183.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:36:20,404 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:36:20,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 515.69 ms. Allocated memory was 134.7 MB in the beginning and 203.4 MB in the end (delta: 68.7 MB). Free memory was 88.8 MB in the beginning and 179.9 MB in the end (delta: -91.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:36:20,406 INFO L168 Benchmark]: Boogie Preprocessor took 100.17 ms. Allocated memory is still 203.4 MB. Free memory was 179.9 MB in the beginning and 177.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-09-09 05:36:20,407 INFO L168 Benchmark]: RCFGBuilder took 531.72 ms. Allocated memory is still 203.4 MB. Free memory was 177.2 MB in the beginning and 156.3 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:36:20,409 INFO L168 Benchmark]: TraceAbstraction took 12715.42 ms. Allocated memory was 203.4 MB in the beginning and 348.1 MB in the end (delta: 144.7 MB). Free memory was 155.7 MB in the beginning and 272.2 MB in the end (delta: -116.5 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:36:20,418 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 107.9 MB in the beginning and 107.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 515.69 ms. Allocated memory was 134.7 MB in the beginning and 203.4 MB in the end (delta: 68.7 MB). Free memory was 88.8 MB in the beginning and 179.9 MB in the end (delta: -91.1 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.17 ms. Allocated memory is still 203.4 MB. Free memory was 179.9 MB in the beginning and 177.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 531.72 ms. Allocated memory is still 203.4 MB. Free memory was 177.2 MB in the beginning and 156.3 MB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12715.42 ms. Allocated memory was 203.4 MB in the beginning and 348.1 MB in the end (delta: 144.7 MB). Free memory was 155.7 MB in the beginning and 272.2 MB in the end (delta: -116.5 MB). Peak memory consumption was 28.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 97. Possible FailurePath: [L105] unsigned int a, b, r; [L107] a = __VERIFIER_nondet_uint() [L108] b = __VERIFIER_nondet_uint() [L110] CALL, EXPR mp_add(a, b) VAL [\old(a)=0, \old(b)=0] [L23] unsigned char a0, a1, a2, a3; [L24] unsigned char b0, b1, b2, b3; [L25] unsigned char r0, r1, r2, r3; [L26] unsigned short carry; [L27] unsigned short partial_sum; [L28] unsigned int r; [L29] unsigned char i; [L30] unsigned char na, nb; [L31] a0 = a [L32] a1 = a >> 8 [L33] a2 = a >> 16U [L34] a3 = a >> 24U [L35] b0 = b [L36] b1 = b >> 8U [L37] b2 = b >> 16U [L38] b3 = b >> 24U [L39] na = (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=4] [L40] COND TRUE a3 == (unsigned char)0 [L41] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=3] [L42] COND TRUE a2 == (unsigned char)0 [L43] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=2] [L44] COND TRUE a1 == (unsigned char)0 [L45] na = na - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1] [L49] nb = (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=4] [L50] COND TRUE b3 == (unsigned char)0 [L51] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=3] [L52] COND TRUE b2 == (unsigned char)0 [L53] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=2] [L54] COND TRUE b1 == (unsigned char)0 [L55] nb = nb - 1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, na=1, nb=1] [L59] carry = (unsigned short)0 [L60] i = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1] [L61] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L62] partial_sum = carry [L63] carry = (unsigned short)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L64] COND TRUE i < na VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L65] COND TRUE i == (unsigned char)0 [L65] partial_sum = partial_sum + a0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L66] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L67] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L68] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L70] COND TRUE i < nb VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L71] COND TRUE i == (unsigned char)0 [L71] partial_sum = partial_sum + b0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L72] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L73] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L74] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L76] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0] [L80] COND TRUE i == (unsigned char)0 [L80] r0 = (unsigned char)partial_sum VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L81] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L82] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L83] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=0, na=1, nb=1, partial_sum=0, r0=0] [L85] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L61] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0] [L90] COND TRUE i == (unsigned char)1 [L90] r1 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L92] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=1, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0] [L91] COND TRUE i == (unsigned char)2 [L91] r2 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=2, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L88] COND TRUE i < (unsigned char)4 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L89] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0] [L92] COND TRUE i == (unsigned char)3 [L92] r3 = (unsigned char)0 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=3, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L94] i = i + (unsigned char)1 VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L88] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=0, \old(b)=0, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r0=0, r1=0, r2=0, r3=0] [L97] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L99] return r; VAL [\old(a)=0, \old(b)=0, \result=1, a=0, a0=0, a1=0, a2=0, a3=0, b=0, b0=0, b1=0, b2=0, b3=0, carry=0, i=4, na=1, nb=1, partial_sum=0, r=1, r0=0, r1=0, r2=0, r3=0] [L110] RET, EXPR mp_add(a, b) VAL [a=0, b=0, mp_add(a, b)=1] [L110] r = mp_add(a, b) [L112] CALL __VERIFIER_assert(r == a + b) VAL [\old(cond)=0] [L5] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 54 locations, 1 error locations. UNSAFE Result, 12.6s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1202 SDtfs, 2078 SDslu, 2489 SDs, 0 SdLazy, 3492 SolverSat, 375 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 239 SyntacticMatches, 10 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1903occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.7s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 2734 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 764 NumberOfCodeBlocks, 764 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 800 ConstructedInterpolants, 82 QuantifiedInterpolants, 183406 SizeOfPredicates, 10 NumberOfNonLiveVariables, 287 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 PerfectInterpolantSequences, 362/374 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...